Hierarchical Probabilistic Relational Models for Collaborative Filtering

نویسندگان

  • Jack Newton
  • Russell Greiner
چکیده

This paper applies Probabilistic Relational Models (PRMs) to the Collaborative Filtering task, focussing on the EachMovie data set. We first learn a standard PRM, and show that its performance is competitive with the best known techniques. We then define a hierarchical PRM, which extends standard PRMs by dynamically refining classes into hierarchies, which improves the expressiveness as well as the context sensitivity of the PRM. Finally, we show that hierarchical PRMs achieve state-of-the-art results on this dataset.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Bayesian Probabilistic Matrix Factorization

Collaborative filtering algorithms generally rely on the assumption that user preference patterns remain stationary. However, real-world relational data are seldom stationary. User preference patterns may change over time, giving rise to the requirement of designing collaborative filtering systems capable of detecting and adapting to preference pattern shifts. Motivated by this observation, in ...

متن کامل

Using Probabilistic Relational Models for Collaborative Filtering

Recent projects in collaborative filtering and information filtering address the task of inferring user preference relationships for products or information. The data on which these inferences are based typically consists of pairs of people and items. The items may be information sources (such as web pages or newspaper articles) or products (such as books, software, movies or CDs). We are inter...

متن کامل

Collaborative Ensemble Learning: Combining Collaborative and Content-Based Information Filtering via Hierarchical Bayes

Collaborative filtering (CF) and contentbased filtering (CBF) have widely been used in information filtering applications, both approaches having their individual strengths and weaknesses. This paper proposes a novel probabilistic framework to unify CF and CBF, named collaborative ensemble learning. Based on content based probabilistic models for each user’s preferences (the CBF idea), it combi...

متن کامل

Title of Thesis: Hierarchical Probabilistic Relational Models for Recommender Systems Hierarchical Probabilistic Relational Models for Recommender Systems

In this thesis we describe an approach to the recommender system problem based on the Probabilistic Relational Model framework. Traditionally, recommender systems have fallen into two broad categories: content-based and collaborative-filteringbased recommender systems, each of which has a distinct set of strengths and weaknesses. We present a sound statistical framework for integrating both of ...

متن کامل

Relational Graphical Models for Collaborative Filtering and Recommendation of Computational Workflow Components

This paper describes preliminary work on using graphical models to represent relational data in computational science portals such as myGrid. The objective is to provide a integrative collaborative filtering (CF) capability to users of data, metadata, source code, and experimental documentation in some domain of interest. Recent systems such as ResearchIndex / CiteSeer provide collaborative rec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004